A Greedy Algorithm for Neighborhood Overlap-Based Community Detection
نویسندگان
چکیده
منابع مشابه
A Greedy Algorithm for Neighborhood Overlap-Based Community Detection
The neighborhood overlap (NOVER) of an edge u-v is defined as the ratio of the number of nodes who are neighbors for both u and v to that of the number of nodes who are neighbors of at least u or v. In this paper, we hypothesize that an edge u-v with a lower NOVER score bridges two or more sets of vertices, with very few edges (other than u-v) connecting vertices from one set to another set. Ac...
متن کاملA Greedy Community-Mining Algorithm Based on Clustering Coefficient
A community in a large, real-life network, such as the World Wide Web (Web), has been broadly defined as a group of nodes that are densely linked with each other, while being sparsely linked with the rest of the nodes. In the last 2-3 years, community-mining in such networks has emerged as a problem of great practical significance. This problem has been framed in at least two different versions...
متن کاملAn Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملOn a greedy learning algorithm for dPLRM detection
In this work we investigate the use of a greedy training algorithm for the dual Penalized Logistic RegressionMachine (dPLRM), and our target application is detection of broad class phonetic features. The use of a greedy training algorithm is meant to alleviate the infeasible memory and computational demands that arises during the learning phase when the amount of training data increases. We sho...
متن کاملA Neighborhood-Based Clustering Algorithm
In this paper, we present a new clustering algorithm, NBC, i.e., Neighborhood Based Clustering, which discovers clusters based on the neighborhood characteristics of data. The NBC algorithm has the following advantages: (1) NBC is effective in discovering clusters of arbitrary shape and different densities; (2) NBC needs fewer input parameters than the existing clustering algorithms; (3) NBC ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2016
ISSN: 1999-4893
DOI: 10.3390/a9010008